A Theory of Indirection via Approximation Aquinas Hobor ∗† Robert Dockins† Andrew W. Appel †

Source URL: www.cs.princeton.edu

• Mathematical logic
• Software engineering
• Logic
• Formal languages
• Computability theory
• Models of computation
• Lambda calculus
• Formal methods
• Interpretation
• Syntactic predicate
• System F
• Monad

3 Scientific Information 3.1

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Analysis of algorithms
• Online algorithms
• Computer science
• Theory of computation
• Competitive analysis
• List update problem
• Adversary model
• Algorithm
• Randomized algorithm
• Travelling salesman problem
• Time complexity

Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second,

Source URL: www.scottaaronson.com

• Theory of computation
• Computability theory
• Busy beaver
• Computable function
• Computability
• Turing machine
• Halting problem
• Hypercomputation
• Computable number
• Algorithm
• Alan Turing
• Ackermann function

UW-CPTCExponential Growth of Nonlinear Ballooning Instability P. Zhu, C. C. Hegna, and C. R. Sovinec Center for Plasma Theory and Computation University of Wisconsin-Madison

Source URL: www.cptc.wisc.edu

Density Computations for Real Quadratic Units Wieb Bosma; Peter Stevenhagen Mathematics of Computation, Vol. 65, NoJul., 1996), ppStable URL: http://links.jstor.org/sici?sici=%%2965%

Source URL: www.math.ru.nl

• Algebra
• Mathematics
• Abstract algebra
• Algebraic number theory
• Quadratic forms
• Field theory
• Modular arithmetic
• Quadratic field
• Prime number
• Discriminant
• Fundamental unit
• Factorization

Presenter and Main Author Co-Authors, if any Title

Source URL: www.strc.ch

• Multi-agent systems
• Complex systems theory
• Models of computation
• Systems science
• Traffic simulation
• Scientific modeling
• Computing
• Agent-based model
• MATSim
• Kay
• Simulation
• Transport network

Computation Group Lecture Series, Department of Architecture, Massachusetts Institute of Technology “Craft and the Computer: Theory and Practice” December 9, :30 - 2:00pm Room 7-431

Source URL: descomp.scripts.mit.edu

Algorithmic Game Theory∗ Tim Roughgarden† May 12, 2009 1

Source URL: theory.stanford.edu

• Game theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Algorithmic game theory
• Price of anarchy
• Algorithmic mechanism design
• Mechanism design
• Approximation algorithm
• PPAD
• Epsilon-equilibrium
• Computational complexity theory

On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson

Source URL: highlights-conference.org

• Complexity classes
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Computational complexity theory
• Computer science
• Boolean circuit
• Logic in computer science
• NC
• P
• Circuit
• FO

7 Professor Rod Downey, Logician, Surfer, Scottish Country Dancer I try to understand the intrinsic difficulty of computation; how can mathematical processes be algorithmically implemented either in theory or in practic

Source URL: homepages.ecs.vuw.ac.nz